Reconfiguration of list edge-colorings in a graph

11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. ProceedingsWe study the problem of reconfiguring one list edge-coloring of a graph into another list edge-coloring by changing one edge color at a time, while at all times maintaining a list edge-coloring, given a list of allowed colors for each edge. First we show that this problem is PSPACE-complete, even for planar graphs of maximum degree 3 and just six colors. Then we consider the problem restricted to trees. We show that any list edge-coloring can be transformed into any other under the sufficient condition that the number of allowed colors for each edge is strictly larger than the degrees of both its endpoints. This sufficient condition is best possible in some sense. Our proof yields a polynomial-time algorithm that finds a transformation between two given list edge-colorings of a tree with n vertices using O(n [superscript 2]) recolor steps. This worst-case bound is tight: we give an infinite family of instances on paths that satisfy our sufficient condition and whose reconfiguration requires Ω(n [superscript 2]) recolor steps

Reconfiguration of Dominating Sets

We explore a reconfiguration version of the dominating set problem, where a dominating set in a graph $G$ is a set $S$ of vertices such that each vertex is either in $S$ or has a neighbour in $S$. In a reconfiguration problem, the goal is to determine whether there exists a sequence of feasible solutions connecting given feasible solutions $s$ and $t$ such that each pair of consecutive solutions is adjacent according to a specified adjacency relation. Two dominating sets are adjacent if one can be formed from the other by the addition or deletion of a single vertex. For various values of $k$, we consider properties of $D_k(G)$, the graph consisting of a vertex for each dominating set of size at most $k$ and edges specified by the adjacency relation. Addressing an open question posed by Haas and Seyffarth, we demonstrate that $D_{\Gamma(G)+1}(G)$ is not necessarily connected, for $\Gamma(G)$ the maximum cardinality of a minimal dominating set in $G$. The result holds even when graphs are constrained to be planar, of bounded tree-width, or $b$-partite for $b \ge 3$. Moreover, we construct an infinite family of graphs such that $D_{\gamma(G)+1}(G)$ has exponential diameter, for $\gamma(G)$ the minimum size of a dominating set. On the positive side, we show that $D_{n-m}(G)$ is connected and of linear diameter for any graph $G$ on $n$ vertices having at least $m+1$ independent edges.Comment: 12 pages, 4 figure

Reconfiguring Independent Sets in Claw-Free Graphs

We present a polynomial-time algorithm that, given two independent sets in a claw-free graph $G$, decides whether one can be transformed into the other by a sequence of elementary steps. Each elementary step is to remove a vertex $v$ from the current independent set $S$ and to add a new vertex $w$ (not in $S$) such that the result is again an independent set. We also consider the more restricted model where $v$ and $w$ have to be adjacent

Sum rule for the backward spin polarizability of the nucleon from a backward dispersion relation

A new sum rule for $\gamma_\pi$, the backward spin polarizability of the nucleon, is derived from a backward-angle dispersion relation. Taking into account single- and multi-pion photoproduction in the s-channel up to the energy 1.5 GeV and resonances in the t-channel with mass below 1.5 GeV, it is found for the proton and neutron that $[\gamma_\pi]_p$ = -39.5 +/- 2.4 and $[\gamma_\pi]_n$ = 52.5 +/- 2.4, respectively, in units of 10^{-4} fm^4.Comment: 10 pages, 1 figure, revtex. Submitted to Phys. Lett.

Approximability of the Subset Sum Reconfiguration Problem

The subset sum problem is a well-known NP-complete problem in which we wish to find a packing (subset) of items (integers) into a knapsack with capacity so that the sum of the integers in the packing is at most the capacity of the knapsack and at least a given integer threshold. In this paper, we study the problem of reconfiguring one packing into another packing by moving only one item at a time, while at all times maintaining the feasibility of packings. First we show that this decision problem is strongly NP-hard, and is PSPACE-complete if we are given a conflict graph for the set of items in which each vertex corresponds to an item and each edge represents a pair of items that are not allowed to be packed together into the knapsack. We then study an optimization version of the problem: we wish to maximize the minimum sum among all packings in the reconfiguration. We show that this maximization problem admits a polynomial-time approximation scheme (PTAS), while the problem is APX-hard if we are given a conflict graph

Dangerous work: The gendered nature of bullying in the context of higher education

This paper discusses results from a research project which set out to investigate gender differences in the nature and experience of bullying within the higher education sector. Gender differences emerged in the form and perception of bullying as well as in target response. Results also indicate that, irrespective of gender, bullies can capture and subvert organizational structures and procedures (official hierarchies, mentoring systems, probationary reviews) to further their abuse of the target and to conceal aggressive intent. These outcomes are discussed in relation to gendered assumptions behind management practices and in relation to the masculinist ethic that underpins many higher education management initiatives. Overall, results indicate that bullying cannot be divorced from gender and that such behaviour needs to be seen in a gendered context

Evaluation of the bovine ATP-binding cassette subfamily A member 13 (ABCA13) as a potential biomarker for sensitive detection of animals with focal pathological forms of subclinical paratuberculosis

Trabajo presentado al: ICP 15th International Association for Paratuberculous, Dublín, 12-16 Junio. 2022.Peer reviewe

Diving into the vertical dimension of elasmobranch movement ecology

Knowledge of the three-dimensional movement patterns of elasmobranchs is vital to understand their ecological roles and exposure to anthropogenic pressures. To date, comparative studies among species at global scales have mostly focused on horizontal movements. Our study addresses the knowledge gap of vertical movements by compiling the first global synthesis of vertical habitat use by elasmobranchs from data obtained by deployment of 989 biotelemetry tags on 38 elasmobranch species. Elasmobranchs displayed high intra- and interspecific variability in vertical movement patterns. Substantial vertical overlap was observed for many epipelagic elasmobranchs, indicating an increased likelihood to display spatial overlap, biologically interact, and share similar risk to anthropogenic threats that vary on a vertical gradient. We highlight the critical next steps toward incorporating vertical movement into global management and monitoring strategies for elasmobranchs, emphasizing the need to address geographic and taxonomic biases in deployments and to concurrently consider both horizontal and vertical movements

On the symbolic computation of the hardest configurations of the RUSH HOUR game

SCOPUS: cp.kinfo:eu-repo/semantics/publishe

Negotiating multiple positionalities in the interview setting: researching across gender and generational boundaries

This article explores the multiple positionalities that were negotiated during qualitative interviews conducted with older British men who are grandfathers, by a young female early career researcher. Gender, and other methodological challenges negotiated by researchers of men and masculinities have been critiqued, but negotiations of age and generational differences in the field remain scant, despite recognition that age also structures socially constructed and spatially experienced identities. Including reflections on personal research experiences, the article outlines the need for explicit critical attention by geographers to the influence of the fluid intersectional identities of the researcher/researched on research experiences in the field and research outcomes